Optimal Pricing Schemes for Public Wireless Networks
نویسندگان
چکیده
We consider a public wireless network with one access point (AP) and several users. The wireless network is setup by a service provider (SP) to enable Internet connections in public areas such as parks, libraries, and cafes. The service provider establishes appropriate pricing schemes to charge the users in order to cover its own cost in the setup and maintenance of the public wireless network. According to their demand and the prices, users choose the best pricing schemes for themselves. We can regard this public network as a three-layer network, with the three layers as the technology layer, the application layer, and the economic layer. In the next three subsections, we will describe these three layers and their interaction in details. Since the arrival and departure of users can take place at any time instant, we use a continuous-time model to describe the system. We denote t as the index of time. According to their arrival and departure processes and utility functions, the users are inherently categorized into K types, where the user type is indexed by k. We define the total number of type-k users, no matter in service or not, as Nk. Note that the type is the inherent property of a user, which is the user’s private information. However, since the users of the same type will choose the same payment plan, the service provider can partially observe the type of a user by the payment plan that user subscribes to. In other words, the service provider categorizes the users by their payment plans. We call this categorization as the user’s payment type. We assume that there are L payment plans. Then we can define the mapping from the inherent type k of a user to its payment type l as
منابع مشابه
LPKP: location-based probabilistic key pre-distribution scheme for large-scale wireless sensor networks using graph coloring
Communication security of wireless sensor networks is achieved using cryptographic keys assigned to the nodes. Due to resource constraints in such networks, random key pre-distribution schemes are of high interest. Although in most of these schemes no location information is considered, there are scenarios that location information can be obtained by nodes after their deployment. In this paper,...
متن کاملCongestion Control Approaches Applied to Wireless Sensor Networks: A Survey
Wireless Sensor Networks (WSNs) are a specific category of wireless ad-hoc networks where their performance is highly affected by application, life time, storage capacity, processing power, topology changes, the communication medium and bandwidth. These limitations necessitate an effective data transport control in WSNs considering quality of service, energy efficiency, and congestion control. ...
متن کاملA Rssi Based Localization Algorithm for WSN Using a Mobile Anchor Node
Wireless sensor networks attracting a great deal of research interest. Accurate localization of sensor nodes is a strong requirement in a wide area of applications. In recent years, several techniques have been proposed for localization in wireless sensor networks. In this paper we present a localization scheme with using only one mobile anchor station and received signal strength indicator tec...
متن کامل3D Path Planning Algorithm for Mobile Anchor-Assisted Positioning in Wireless Sensor Networks
Positioning service is one of Wireless Sensor Networks’ (WSNs) fundamental services. The accurate position of the sensor nodes plays a vital role in many applications of WSNs. In this paper, a 3D positioning algorithm is being proposed, using mobile anchor node to assist sensor nodes in order to estimate their positions in a 3D geospatial environment. However, mobile anchor node’s 3D path optim...
متن کاملQuasi Random Deployment Strategy for Reliable Communication Backbones in Wireless Sensor Networks
Topology construction and topology maintenance are significant sub-problems of topology control. Spanning tree based algorithms for topology control are basically transmission range based type construction algorithms. The construction of an effective backbone, however, is indirectly related to the placement of nodes. Also, the dependence of network reliability on the communication path undertak...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015